On the Numerical Approximation of First-Order Hamilton-Jacobi Equations
نویسندگان
چکیده
We review some methods for the numerical approximation of time dependent and steady first order Hamilton Jacobi equations. Most of the discussion focuses on conformal triangular type meshes but we show how to extend this to the most general meshes. We review some first order monotone schemes and also high order ones specially dedicated to steady problems.
منابع مشابه
High Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations
We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...
متن کاملIdentification of Sparse Operators
[1] J.-L. Guermond and B. Popov, Linear advection with ill-posed boundary conditions via L1-minimization, Numerical Analysis and Modeling 4 (2007), 39–47. [2] J.-L. Guermond and B. Popov, L1-minimization methods for Hamilton-Jacobi equations: the one-dimensional case, submitted. [3] J.-L. Guermond and B. Popov, L1-approximation of stationary Hamilton-Jacobi equations, submitted. [4] J.-L. Guerm...
متن کاملSolving linear and nonlinear optimal control problem using modified adomian decomposition method
First Riccati equation with matrix variable coefficients, arising in optimal and robust control approach, is considered. An analytical approximation of the solution of nonlinear differential Riccati equation is investigated using the Adomian decomposition method. An application in optimal control is presented. The solution in different order of approximations and different methods of approximat...
متن کاملOn the non-existence of higher order monotone approximation schemes for HJB equations
In this work we present a result on the non-existence of monotone, consistent linear discrete approximation of order higher than 2. This is an essential ingredient, if we want to solve numerically nonlinear and particularly Hamilton-Jacobi-Bellman (HJB) equations.
متن کاملValue iteration convergence of ε-monotone schemes for stationary Hamilton-Jacobi equations
We present an abstract convergence result for the fixed point approximation of stationary Hamilton–Jacobi equations. The basic assumptions on the discrete operator are invariance with respect to the addition of constants, ε-monotonicity and consistency. The result can be applied to various high-order approximation schemes which are illustrated in the paper. Several applications to Hamilton–Jaco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computer Science
دوره 17 شماره
صفحات -
تاریخ انتشار 2007